IRREDUCIBILITY OF POLYNOMIALS MODULO p VIA NEWTON POLYTOPES
نویسندگان
چکیده
Ostrowski established in 1919 that an absolutely irreducible integral polynomial remains absolutely irreducible modulo all sufficiently large prime numbers. We obtain a new lower bound for the size of such primes in terms of the number of integral points in the Newton polytope of the polynomial, significantly improving previous estimates for sparse polynomials.
منابع مشابه
Absolute Irreducibility of Polynomials via Newton Polytopes
A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial is absolutely irreducible if its Newton polytope is indecomposable in the sense of Minkowski sum of polytopes. Two general constructions of indecomposable polytopes are given, and they give many simple irreducibility criteria including the well-known Eisenstein’s criterion. Polynomials from these ...
متن کاملDecomposition of Polytopes and Polynomials
Motivated by a connection with the factorization of multivariable polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral polygons is NP-complete then present a pseudo-polynomial time algorithm for decomposing polygons. For higher dimensional polytopes, we give a heuristic algori...
متن کاملEinladung Im Oberseminar Reelle Geometrie Und Algebra Hält Coercive Polynomials and Their Newton Polytopes
Many interesting properties of polynomials are closely related to the geometry of their Newton polytopes. We analyze the coercivity on R of multivariate polynomials f ∈ R[x] in terms of their Newton polytopes. In fact, we introduce the broad class of so-called gem regular polynomials and characterize their coercivity via conditions imposed on the vertex set of their Newton polytopes. These cond...
متن کاملModular Las Vegas algorithms for polynomial absolute factorization
Let f(X,Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f , or more precisely, of f modulo some prime integer p. The same idea of choosing a p satisfying some prescribed properties together with LLL is used to provide a new strategy for absolute factorization of f(X, Y ). We present our approach i...
متن کاملCoercive Polynomials and Their Newton Polytopes
Many interesting properties of polynomials are closely related to the geometry of their Newton polytopes. In this article we analyze the coercivity on Rn of multivariate polynomials f ∈ R[x] in terms of their Newton polytopes. In fact, we introduce the broad class of so-called gem regular polynomials and characterize their coercivity via conditions imposed on the vertex set of their Newton poly...
متن کامل